Cellular Automaton Fluids 1: Basic Theory

نویسنده

  • Stephen Wolfram
چکیده

Continuum equations are derived for the large-scale behavior of a class of cellular automaton models for fluids. The cellular automata are discrete analogues of molecular dynamics, in which particles with discrete velocities populate the links of a fixed array of sites. Kinetic equations for microscopic particle distributions are constructed. Hydrodynamic equations are then derived using the Chapman-Enskog expansion. Slightly modified Navier-Stokes equations are obtained in two and three dimensions with certain lattices. Viscosities and other transport coefficients are calculated using the Boltzmann transport equation approximation. Some corrections to the equations of motion for cellular automaton fluids beyond the Navier-Stokes order are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Cellular Automaton Approaches to Modeling Biological Cells

We discuss two different types of Cellular Automata (CA): lattice-gasbased cellular automata (LGCA) and the cellular Potts model (CPM), and describe their applications in biological modeling. LGCA were originally developed for modeling ideal gases and fluids. We describe several extensions of the classical LGCA model to self-driven biological cells. In particular, we review recent models for ri...

متن کامل

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

متن کامل

A Decision Procedure for Unitary Linear Quantum Cellular Automata

Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution operator has to be a unitary transformation. In this paper we give an efficient algorithm to decide if a linear quantum cellular automaton is unitary. The c...

متن کامل

Two-dimensional cellular automaton model of traffic flow with open boundaries.

A two-dimensional cellular automaton model of traffic flow with open boundaries are investigated by computer simulations. The outflow of cars from the system and the average velocity are investigated. The time sequences of the outflow and average velocity have flicker noises in a jamming phase. The low density behavior are discussed with simple jam-free approximation. 64.60.Cn, 05.70.Ln Typeset...

متن کامل

Propositional Proof Complexity and Cellular Automata 22

Two fields connected with computers, automated theorem proving on one side and computational complexity theory on the other side, gave the birth to the field of propositional proof complexity in the late ’60s and ’70s. In this chapter we consider how classic propositional logic and in particular Propositional Proof Complexity can be combined with the study of Cellular Automata. It is organized ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004